Breadth-first search - PDFSEARCH.IO - Document Search Engine

Breadth-first search
Results: 170

#	Item
31	C:/Documents and Settings/kanza/Desktop/SoNetGIS/Camera Ready/main.dvi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-09-07 07:09:50 Database management systems Network theory Graph database Search algorithms Database Graph Spatial database Breadth-first search Relational model Graph theory Mathematics Theoretical computer science
32	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Graph coloring Networks Connectivity Dominating set Edge coloring Network theory Copying mechanism Breadth-first search Graph theory Theoretical computer science Mathematics
33	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics Combinatorics Binary trees Spanning tree Breadth-first search Search algorithms Graph theory Depth-first search
34	Computing the Shortest Path: A∗ Search Meets Graph Theory Andrew V. Goldberg∗ Abstract We propose shortest path algorithms that use A∗ search in combination with a new graph-theoretic lower-bounding technique based Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-10-12 13:22:52 Search algorithms Routing algorithms Network theory Shortest path problem Breadth-first search Distance Connected component Graph Algorithm Mathematics Graph theory Theoretical computer science
35	Simply Logical – Chapter 5 p.102 © Peter Flach, 2000 % search(Agenda,Goal) <- Goal is a goal node, and a % Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2001-01-29 09:42:08 Iterative deepening depth-first search Depth-first search Logic programming Computer programming Backtracking Breadth-first search Search algorithms Artificial intelligence Mathematics
36	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Breadth-first search Graph Combinatorics Theoretical computer science Network theory Tango tree Search algorithms Graph theory Mathematics
37	An Algorithm for Avoiding Plateaus in Heuristic Search Bachelor Thesis Natural Science Faculty of the University of Basel Department of Mathematics and Computer Science Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2013-09-25 13:15:52 Applied mathematics Heuristic function A* search algorithm Best-first search Heuristic Breadth-first search Algorithm Admissible heuristic Consistent heuristic Search algorithms Artificial intelligence Mathematics
38	ICS 260 – Fall 2001 – First Midterm Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2001-10-18 19:06:29 Network flow Maximum flow problem Flow network Matching Shortest path problem Distance Circulation problem Graph Breadth-first search Graph theory Mathematics Theoretical computer science
39	1 A large-scale community structure analysis in Facebook Emilio Ferrara1 1 Department of Mathematics, University of Messina, Italy ∗ E-mail: Add to Reading List Source URL: arxiv.org Language: English Mathematics Science Community structure Modularity Social network Sampling Complex network Power law Breadth-first search Network theory Networks Graph theory
40	Animated Exploration of Dynamic Graphs with Radial Layout Ka-Ping Yee Danyel Fisher Rachna Dhamija Add to Reading List Source URL: bailando.sims.berkeley.edu Language: English - Date: 2001-08-08 17:18:23 Radial tree Tree Topology Breadth-first search Force-based algorithms B-tree Node Hyperbolic tree SpicyNodes Graph theory Graph drawing Mathematics